A heuristic algorithm for drawing of a flow diagram
نویسندگان
چکیده
A flow diagram is a graphical presentation of an energy or chemical system with its components and their interconnections through mass and energy streams. An automatic drawing algorithm of flow diagrams has been developed and presented in this article. It heuristically imitates all the procedures carried out by a designer, starting with his conceptual understanding of the system’s topological structure and finishing with graphically representing the system on the paper or screen. The topological structure of the system is given as input in the form of digraph. As a first step, it is transformed to a planar digraph by introducing new vertices representing crossings between the various streams. The near-optimum (smallest) number of crossings is determined heuristically. Then the flow diagram is drawn on the screen using special mechanical engineering symbols for the components of the system. Horizontal and vertical lines represent streams of mass or energy, identified by different colors. Unnecessary expansion of the drawing area is avoided by the application of linear and integer-linear programming algorithms. q 2001 Elsevier Science Ltd. All rights reserved.
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملNew Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملTransonic Turbulent Flow Simulation using Pressure-Based Method and Normalized Variable Diagram
A pressure-based implicit procedure to solve the Euler and Navier-Stokes equations on a nonorthogonal mesh with collocated finite volume formulation is described. The boundedness criteria for this procedure are determined from Normalized Variable diagram (NVD) scheme.The procedure incorporates the ε−k eddy-viscosity turbulence model. The algorithm is tested for inviscid and turbulent transonic ...
متن کاملAnalysis of deep drawing process to predict the forming severity considering inverse finite element and extended strain-based forming limit diagram
An enhanced unfolding Inverse Finite Element Method (IFEM) has been used together with an extended strain-based forming limit diagram (EFLD) to develop a fast and reliable approach to predict the feasibility of the deep drawing process of a part and determining where the failure or defects can occur. In the developed unfolding IFEM, the meshed part is properly fold out on the flat sheet and tre...
متن کامل